Algorithms for Branching MDPs and Branching Stochastic Games
نویسندگان
چکیده
منابع مشابه
Branching Algorithms
We provide an introduction to the design and analysis of moderately exponential-time branching algorithms via the study of a collection of such algorithms among them algorithms for Maximum Independent Set, SAT and 3-SAT. The tools for simple running time analysis are presented. The limits of such an analysis including lower bounds for the worst-case running time of some particular branching alg...
متن کاملModel Checking Games for Branching Time Logics
This paper defines and examines model checking games for the branching time temporal logic CTL∗. The games employ a technique called focus which enriches sets by picking out one distinguished element. This is necessary to avoid ambiguities in the regeneration of temporal operators. The correctness of these games is proved, and optimisations are considered to obtain model checking games for impo...
متن کاملSatisfiability Games for Branching-Time Logics
The satisfiability problem for branching-time temporal logics like CTL∗, CTL and CTL has important applications in program specification and verification. Their computational complexities are known: CTL∗ and CTL are complete for doubly exponential time, CTL is complete for single exponential time. Some decision procedures for these logics are known; they use tree automata, tableaux or axiom sys...
متن کاملBranching Processes in Stochastic Environments
This paper is concerned with two simple models for branching processes in stochastic environments. The models are identical to the model for the classical Galton-Watson branching process in all respects but one. In the family-tree language commonly used to describe branching processes, that difference is that the probability distribution for the number of offspring of an object changes stochast...
متن کاملEvolutionary Branching in a Finite Population: Deterministic Branching vs. Stochastic Branching
Adaptive dynamics formalism demonstrates that, in a constant environment, a continuous trait may first converge to a singular point followed by spontaneous transition from a unimodal trait distribution into a bimodal one, which is called "evolutionary branching." Most previous analyses of evolutionary branching have been conducted in an infinitely large population. Here, we study the effect of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2016
ISSN: 2075-2180
DOI: 10.4204/eptcs.220.0.4